BRep-Index: A Multi-Dimensional Space Partitioning Tree
نویسندگان
چکیده
In this paper we introduce the brep-index, a new multi-dimensional space partitioning data structure that provides quick access to the vertices, edges and faces of a boundary representation (brep), thus yielding a single unified representation for polyhedral solids. We d~cribe the cortStruction of the brep-index and show that its size is O(v +e + f), where VI €I and J are the number of vertices, edges, and faces of the hrep. The lower bound can be achieved for some breps by compressing the structure using simple rewrite rules. We apply the hrep-index to solve the point/solid and the line/solid classification problems, and outline an efficient collision detection algorithm as an example of its use.
منابع مشابه
Conversion of Binary Space Partitioning Trees to Boundary Representation
Binary Space Partitioning Trees (BSP-Trees) have been proposed as an alternative way to represent polytopes based on the spatial subdivision paradigm. Algorithms that convert from Boundary Representation (BRep) to BSP-Trees have been proposed, but none is known to perform the opposite conversion. In this paper we present such an algorithm, that takes as input a BSP-Tree representation for a pol...
متن کاملConversion of Binary Space
Binary Space Partitioning Trees (BSP-Trees) have been proposed as an alternative way to represent polytopes based on the spatial subdivision paradigm. Algorithms that convert from Boundary Representation (BRep) to BSP-Trees have been proposed, but none is known to perform the opposite conversion. In this paper we present such an algorithm , that takes as input a BSP-Tree representation for a po...
متن کاملGeneralizations of suffix arrays to multi-dimensional matrices
We propose multi-dimensional index data structures that generalize su x arrays to square matrices and cubic matrices. Giancarlo proposed a two-dimensional index data structure, the Lsu x tree, that generalizes su x trees to square matrices. However, the construction algorithm for Lsu x trees maintains complicated data structures and uses a large amount of space. We present simple and practical ...
متن کاملThe Hybrid Tree: An Index Structure for High Dimensional Feature Spaces
Feature based similarity search is emerging as an important search paradigm in database systems. The technique used is to map the data items as points into a high dimensional feature space which is indexed using a multidimensional data structure. Similarity search then corresponds to a range search over the data structure. Although several data structures have been proposed for feature indexing...
متن کاملSpace-Partitioning-Based Bulk-Loading for the NSP-Tree in Non-ordered Discrete Data Spaces
Properly-designed bulk-loading techniques are more efficient than the conventional tuple-loading method in constructing a multidimensional index tree for a large data set. Although a number of bulkloading algorithms have been proposed in the literature, most of them were designed for continuous data spaces (CDS) and cannot be directly applied to non-ordered discrete data spaces (NDDS). In this ...
متن کامل